On the solution-space geometry of random constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Random Constraint Satisfaction Problems
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r = m/n where solutions are known to exist with probability close to one due to non-constructive arguments. However, no algorithms are known to find solutions efficiently with a non-vanishing probability at e...
متن کاملOn Refutation of Random Constraint Satisfaction Problems
Given a k-ary predicate P , a random instance of a constraint satisfaction problem (CSP) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m n. Although this fact can be proven via a simple probabilistic argument, certifying that a given randomly chosen instance is unsatisfiable, a task calle...
متن کاملSolution space structure of random constraint satisfaction problems with growing domains
Wei Xu, Pan Zhang, Tian Liu4,∗ and Fuzhou Gong School of Mathematics and Systems Science, Beihang University, Beijing 100191, China Santa Fe Institute, Santa Fe, New Mexico 87501, USA State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Chinese Academy of Sciences, Beijing 100190, China Key Laboratory of High Confidence Software Technologies, Ministry of Education, Sch...
متن کاملImplicit Random Constraint Satisfaction Problems
Random CSPs (Constraint Satisfaction Problems) provide interesting benchmarks for experimental evaluation of algorithms. From a theoretical point of view, a lot of recent works have contributed to guarantee the existence of a so-called phase transition and, consequently, of hard and large problem instances. From a practical point of view, due to exponential space complexity, a vast majority of ...
متن کاملOn the phase transitions of random k-constraint satisfaction problems
Constraint satisfaction has received increasing attention these years. Intense research has focused on solving all kinds of constraint satisfaction problems (CSPs). In this paper, first we propose a random CSP model, named k-CSP, that guarantees the existence of phase transitions under certain circumstances. The exact location of the phase transition is quantified and experimental results are p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2011
ISSN: 1042-9832
DOI: 10.1002/rsa.20323